Quantum Algorithm for Data Fitting
نویسندگان
چکیده
منابع مشابه
Quantum Algorithm for Data Fitting Citation
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters.
متن کاملA parallel finite element surface fitting algorithm for data mining
A major task in data mining is to develop automatic techniques to process and to detect patterns in very large data sets. Multivariate regression techniques form the core of many data mining applications. A common assumption is that the multivariate data is well approximated by an additive model involving only first and second order interaction terms. In this case high-dimensional nonparametric...
متن کاملAn Algorithm for Fitting an Archimedean Spiral to Empirical Data
1. Introduction : Let there be a set of (empirically obtained) points Z= (z 1 , z 2 ,…,z n) : n ≥ 3 and any z i = (x i , y i). Let an inspection of the pattern that these points suggest or a conjecture regarding the law governing the generation of these points indicate that they resemble the trace (Buck, pp. 313-318) of a spiral. Then there may arise a need to investigate the law generating suc...
متن کاملA quantum evolutionary algorithm for data clustering
The emerging field of quantum computing has recently created much interest in the computer science community due to the new concepts it suggests to store and process data. In this paper, we explore some of these concepts to cope with the data clustering problem. Data clustering is a key task for most fields like data mining and pattern recognition. It aims to discover cohesive groups in large d...
متن کاملA cultural algorithm for data clustering
Clustering is a widespread data analysis and data mining technique in many fields of study such as engineering, medicine, biology and the like. The aim of clustering is to collect data points. In this paper, a Cultural Algorithm (CA) is presented to optimize partition with N objects into K clusters. The CA is one of the effective methods for searching into the problem space in order to find a n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2012
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.109.050505